Throughput-delay Analysis of Conflict-free Scheduling in Multihop Ad-hoc Networks

This study investigates the performance of an analytical approximation for the throughput-delay characteristic of a multihop ad-hoc network employing conflictfree time division multiplex (TDM) scheduling with halfduplex transceivers. The approximation models traffic at each link as an independent M/D/1 queue and its performance is measured by comparing to simulation results for various topologies, traffic loads, and network sizes. Results indicate that the approximation is most appropriate for a tandem network but is also reasonable for other twodimensional topologies. In the two-dimensional topologies, the approximation clearly improves at high traffic loads but does not exhibit distinguishable trends over the network sizes observed.